286. [V. 1. A. v. Note 254, p. 231]

Path designs P(v, 3, 1) and P(v, 4, 1) with ovals

In this paper we give a complete solution of the problem of path designs P(v,3,l) and P(v,4,1) having an oval.

1 (V)/(πalg 1 (V /Q), πalg 1 (V /Q

Here is a table of misprints in the above book, and " P.3 L.5b " indicates fifth line from the bottom of the page three. If more misprints are found, this errata table will be updated, and a latest version will be posted in the web page

A Pregnant Woman with Factor V Deficiency

Why h2 does not always equal V A/V P?

Over the last decade, there has been a rapid growth in the application of quantitative genetic techniques to evolutionary studies of natural populations. Whereas this work yields enormous insight into evolutionary processes in the wild, the use of modelling techniques and strategies adopted from animal breeders means that estimates of trait heritabilities (h(2)) are highly vulnerable to misinte...

A note on V-free 2-matchings

Motivated by a conjecture of Liang, we introduce a restricted path packing problem in bipartite graphs that we call a V-free 2-matching. We verify the conjecture through a weakening of the hypergraph matching problem. We close the paper by showing that it is NP-complete to decide whether one of the color classes of a bipartite graph can be covered by a V-free 2-matching.